Speeding up Variable Reordering of OBDDs

نویسندگان

  • Christoph Meinel
  • Anna Slobodová
چکیده

In this paper we suggest a block restricted sifting strategy which is based on the restriction of Rudell s sifting to certain blocks of variables The application of this strategy results in a consider able improvement of the time performance without causing a substantial increase of OBDD size The blocks of variables were determined according to some structural properties re ecting the communi cation complexity within the considered OBDD without using any additional information about its functionality or dependency of variables This assures the general usability of the heuristic and the possibility to use it dynamically

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Composition Problem for OBDDs with Multiple Variable Orders

Ordered Binary Decision Diagram (OBDD) is a favorite data structure used for representation Boolean functions in computer-aided synthesis and veriication of digital systems. The secret of its success is the eeciency of the algorithms for Boolean operations, satissability and equivalence check. However, the algorithms work well under condition only that the variable order of considered OBDDs is ...

متن کامل

Dynamic Minimization of Sentential Decision Diagrams

The Sentential Decision Diagram (SDD) is a recently proposed representation of Boolean functions, containing Ordered Binary Decision Diagrams (OBDDs) as a distinguished subclass. While OBDDs are characterized by total variable orders, SDDs are characterized more generally by vtrees. As both OBDDs and SDDs have canonical representations, searching for OBDDs and SDDs of minimal size simplifies to...

متن کامل

Sample Method for Minimization of OBDDs

This paper contributes to the solution of the minimization problem of Ordered Binary Decision Diagrams by means of variable reordering. We suggest a new heuristic that is based on sampling. A small OBDD sample is chosen from the OBDDs that are considered for minimization. Solving the problem for this small sample, we obtain a variable order that is adapt for the entire OBDDs. We present rst exp...

متن کامل

Algorithmic Considerations for +-OBDD Reordering

Ordered Binary Decision Diagrams (OBDDs) have already proved useful in the process of electronic design automation. Due to limitations of the descriptive power of OBDDs more general models of Binary Decision Diagrams have been studied. In this paper, we address-OBDDs and introduce algorithms for improving their eeciency by reordering of variables and functional nodes.

متن کامل

On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables

In 2004 Atserias, Kolaitis and Vardi proposed OBDD-based propositional proof systems that prove unsatisfiability of a CNF formula by deduction of identically false OBDD from OBDDs representing clauses of the initial formula. All OBDDs in such proofs have the same order of variables. We initiate the study of OBDD based proof systems that additionally contain a rule that allows to change the orde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996